Distributed Dynamic Scheduling of Composite Tasks on Grid Computing Systems
نویسندگان
چکیده
This paper examines the issue of dynamically scheduling applications on a wide-area network computing system. We construct a simulation model for wide-area task allocation problem and study the performance of the proposed algorithm under different conditions. The simulation results indicate that the wide-area scheduling algorithm is sensitive to several parameters including machine failure rates, the local queuing policies, and arrival rates.
منابع مشابه
Green Energy-aware task scheduling using the DVFS technique in Cloud Computing
Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...
متن کاملA new Shuffled Genetic-based Task Scheduling Algorithm in Heterogeneous Distributed Systems
Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...
متن کاملStability Assessment Metamorphic Approach (SAMA) for Effective Scheduling based on Fault Tolerance in Computational Grid
Grid Computing allows coordinated and controlled resource sharing and problem solving in multi-institutional, dynamic virtual organizations. Moreover, fault tolerance and task scheduling is an important issue for large scale computational grid because of its unreliable nature of grid resources. Commonly exploited techniques to realize fault tolerance is periodic Checkpointing that periodically ...
متن کاملA dynamic-balanced scheduler for Genetic Algorithms for Grid Computing
The new paradigm of distributed computation, grid computing, has given rise to a large amount of research on resource scheduling. Unlike the distributed computation, grid computing uses heterogeneous resources, for what grid computing entails new challenges as the adaptation of parallel algorithms before developed for homogeneous resources cluster to the dynamic and heterogeneous resources. In ...
متن کاملReview on a Dynamic Scheduling Algorithm for Grid with Task Duplication
Scheduling of tasks in the grid environment is challenging compared to that in local computing service facilities. In the field of distributed and parallel computing grid computing plays a vital role for solving a wide range of large scale parallel applications. The main goal of task scheduling is to achieve high system throughput and to match the application with the available computing resour...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002